Exponentially many supertrees
نویسنده
چکیده
The amalgamation of leaf-labelled trees into a single supertree that displays each of the input trees is an important problem in classification. Clearly, there can be more than one (super) tree for a given set of input trees, in particular if a highly unresolved supertree exists. Here, we show (by explicit construction) that even if every supertree of a given collection of input trees is binary, there can still be exponentially many such supertrees. @ 2002 Elsevier Science Ltd. All rights reserved. Keywords-Phylogenetic tree, Supertree, Tree amalgamation, Computational complexity.
منابع مشابه
Optimal Agreement Supertrees
An agreement supertree of a collection of unrooted phylogenetic trees {T1, T2, . . . , Tk} with leaf sets L(T1), L(T2), . . . ,L(Tk) is an unrooted tree T with leaf set L(T1) ∪ · · · ∪ L(Tk) such that each tree Ti is an induced subtree of T . In some cases, there may be no possible agreement supertrees of a set of trees, in other cases there may be exponentially many. We present polynomial time...
متن کاملPerformance of flip supertree construction with a heuristic algorithm.
Supertree methods are used to assemble separate phylogenetic trees with shared taxa into larger trees (supertrees) in an effort to construct more comprehensive phylogenetic hypotheses. In spite of much recent interest in supertrees, there are still few methods for supertree construction. The flip supertree problem is an error correction approach that seeks to find a minimum number of changes (f...
متن کاملSupertrees Based on the Subtree Prune-and-Regraft Distance
Supertree methods reconcile a set of phylogenetic trees into a single structure that is often interpreted as a branching history of species. A key challenge is combining conflicting evolutionary histories that are due to artifacts of phylogenetic reconstruction and phenomena such as lateral gene transfer (LGT). Many supertree approaches use optimality criteria that do not reflect underlying pro...
متن کاملThe evolution of supertrees.
Supertrees result from combining many smaller, overlapping phylogenetic trees into a single, more comprehensive tree. As such, supertree construction is probably as old as the field of systematics itself, and remains our only way of visualizing the Tree of Life as a whole. Over the past decade, supertree construction has gained a more formal, objective footing, and has become an area of active ...
متن کاملSubmitted 05.09.03 PERFORMANCE OF FLIP-SUPERTREE HEURISTIC Performance of Flip-Supertree Construction with a Heuristic Algorithm
Supertree methods assemble separate phylogenetic trees with shared taxa into larger trees, or supertrees, in an effort to construct more comprehensive phylogenetic hypotheses. In spite of much recent interest in supertrees, there are still few methods for supertree construction. The flip supertree problem is an error correction approach that seeks to find a minimum number of changes, or "flips"...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Appl. Math. Lett.
دوره 15 شماره
صفحات -
تاریخ انتشار 2002